Maximal Averages over Certain Non-smooth and Non-convex Hypersurfaces
نویسندگان
چکیده
منابع مشابه
Maximal Averages over Flat Radial Hypersurfaces
(*) ||Af ||Lp(Rn) ≤ Cp||f ||Lp(Rn), f ∈ S(R), for p > n n−1 . Moreover, the result is sharp. See [St76], [Gr82]. If the hypersurface S is convex and the order of contact with every tangent line is finite, the optimal exponents for the inequality (∗) are known in R, (see [IoSaSe97]), and in any dimension in the range p > 2, (see [IoSa96]). More precisely, the result in the range p > 2 is the fol...
متن کاملMaximal averages over hypersurfaces and the Newton polyhedron
Here φ(x) is a smooth cutoff function that localizes the surface S near some specific y ∈ S. The goal here is to determine the values of p for which M is bounded on L. The earliest work on this subject was done in the case where S is a sphere, when Stein [St1] showed M is bounded on L iff p > n+1 n for n > 1. This was later generalized by Greenleaf [Gr] to surfaces of nonvanishing Gaussian curv...
متن کاملboundedness of maximal averages over hypersurfaces in R 3
Our goal is to determine for which p is the maximal operator M bounded on L. Note that by subadditivity of maximal operators of the form (1.1), one can prove L boundedness of the nonlocalized analogue of (1.1) over a compact surface by doing a partition of unity and reducing to (1.1). If L is an invertible linear transformation and ML denotes the maximal operator corresponding to the surface L(...
متن کاملRelaxed Majorization-Minimization for Non-Smooth and Non-Convex Optimization
We propose a new majorization-minimization (MM) method for non-smooth and non-convex programs, which is general enough to include the existing MM methods. Besides the local majorization condition, we only require that the difference between the directional derivatives of the objective function and its surrogate function vanishes when the number of iterations approaches infinity, which is a very...
متن کاملNon-smooth Non-convex Bregman Minimization: Unification and new Algorithms
We propose a unifying algorithm for non-smooth non-convex optimization. The algorithm approximates the objective function by a convex model function and finds an approximate (Bregman) proximal point of the convex model. This approximate minimizer of the model function yields a descent direction, along which the next iterate is found. Complemented with an Armijo-like line search strategy, we obt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2018
ISSN: 1027-5487
DOI: 10.11650/tjm/180204